A Fast Algorithm of Generalized Radon-Fourier Transform for Weak Maneuvering Target Detection
نویسندگان
چکیده
منابع مشابه
Radar Maneuvering Target Detection Based on Scaling Processing and Radon-fourier Transform
A novel long-time coherent integration method, i.e., scaling processing and Radon-Fourier transform (SPRFT), is proposed to detect the low-observable manuevering target, which can compensate the range and Doppler migrations simultaneously. The target signal can be well accumulated as an obvious peak in the centroid frequency-chirp rate (CFCR) domain by simple FT calculations. It is shown that p...
متن کاملGENERALIZATION OF TITCHMARSH'S THEOREM FOR THE GENERALIZED FOURIER-BESSEL TRANSFORM
In this paper, using a generalized translation operator, we prove theestimates for the generalized Fourier-Bessel transform in the space L2 on certainclasses of functions.
متن کاملFractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...
متن کاملUsing a Fast Fourier Transform Algorithm
The symmetry and periodicity properties of the discrete Fourier transform (DFT) allow a variety of useful and interesting decompositions. In particular, by clever grouping and reordering of the complex exponential multiplications it is possible to achieve substantial computational savings while still obtaining the exact DFT solution (no approximation required). Many “fast” algorithms have been ...
متن کاملA fast butterfly algorithm for the hyperbolic Radon transform
We introduce a fast butterfly algorithm for the hyperbolic Radon transform commonly used in seismic data processing. For two-dimensional data, the algorithm runs in complexity O(N2 logN), where N is representative of the number of points in either dimension of data space or model space. Using a series of examples, we show that the proposed algorithm is significantly more efficient than conventi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Antennas and Propagation
سال: 2016
ISSN: 1687-5869,1687-5877
DOI: 10.1155/2016/4315616